Method for correcting reciprocity error in two port network measurements

ABSTRACT

A method for correcting reciprocity error in two port network measurements, in which an iterative algorithm is used to obtain an optimal symmetric matrix approximation to a measured 2×2 reciprocal network. The algorithm smooths measured data to obtain a low noise floor on measurements related to mode conversion in cables and connecting hardware. A geometric interpretation is used to approximate a measured data vector with the closest vector which satisfies the reciprocity constraint. An initial point in the constraint surface (reciprocity manifold) is located, and another point which is a better approximation of the measured data vector which satisfies the reciprocity constraint is generated. By repeating this process, the closest point in the manifold is quickly located. This closest point defines a reciprocal matrix which can be used to estimate the actual device under test (DUT) parameters.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to the measurement of network parameters with a multiport network analyzer and, more particularly, to a method for correcting reciprocity error in two port network measurements.

2. Description of the Related Art

In designing cables and connecting hardware for use with high frequency signals, it is imperative to understand the electrical characteristics of the components used to link a device or cable under-test with the electronics used to transmit and receive data. All of the possible couplings between connectors and cables can be measured with multiport measurement equipment comprising a network analyzer and a switching network. The key to providing an accurate multiport measurement system is a two port calibration procedure which is used repeatedly on every combination of pairs of ports in the measurement system.

Errors associated with network analyzer measurements can result from either non-ideal conditions in the measurement equipment or from the effects of the mechanical fixtures, such as cables and connectors, which are used to connect a device under test (DUT) to the network analyzer or test bed. A simple way to model this error is to view the test bed and the DUT as an ideal network analyzer cascaded with an error network and followed by the DUT. Such a network representation is illustrated in FIG. 1. The intervening network can then be used to account for the effects introduced by internal switching matrices connecting the various analyzer ports to the mechanical fixtures, as well as other sources of loss and distortion within the analyzer. The network can also be used to account for the effects of the fixtures themselves, which effects may introduce loss, crosstalk, and impedance discontinuities. Thus, the ideal network analyzer measures the cascaded network consisting of the intervening linear network followed by the DUT and obtains the measured S-parameters of the composite intervening network and DUT, here denoted as S_(M). (See FIG. 1).

During testing, the acquired data which is intended to characterize the DUT is oftentimes corrupted by imperfections in the measuring device. The data must therefore be processed to compensate for known errors when extracting the parameters which describe the DUT, here denoted as S_(A). An algorithm is used to relate the measured parameters S_(M) to the actual parameters S_(A). However, because the intervening network in the model is partially internal to the measurement equipment, S_(A) cannot be evaluated separately. The only way to characterize S_(A), therefore, is to measure various DUTs with known electrical characteristics and extract the appropriate parameters from S_(M). This process is further complicated when switching networks are involved because each change in the switch settings of the network analyzer results in a change in the intervening network due to differences in the signal routing. Thus, a different intervening network exists for each switch setting of the Network Analyzer, and each network must therefore be separately evaluated to compensate for measurement errors.

In general, the characterization of a two port reciprocal network results in a symmetric 2×2 S-parameter matrix. Measurements of this network should therefore show this symmetry but they are often corrupted by noise, resulting in asymmetrical data. This error, which is denoted as reciprocity error, affects the calculations performed on measured data which are intended to correct measurement error. Specifically, the reciprocity error directly affects the noise floor of the calculation of the scattering between modes of propagation in cables and connecting hardware.

It would therefore be advantageous to provide a method for correcting the reciprocity error in measured data obtained during the characterization of a 2×2 S-parameter matrix.

SUMMARY OF THE INVENTION

The above and other problems are overcome by a method for correcting reciprocity error in two port network measurements which is used to produce a matrix with an optimal symmetric approximation of a measured 2×2 reciprocal network. According to the invention, an iterative technique is used to smooth the measured data to obtain a low noise floor on measurements related to mode conversion in cables and connecting hardware.

The calibration procedure for network analyzer measurements relates measured data to actual system parameters. These relationships, combined with the requirement for matrix symmetry, define the explicit form of a reciprocity manifold. The closest point on the manifold surface, occurring when a normal to the surface points directly to the measured data point, is used in defining a reciprocal matrix which can be used to estimate the actual device under test (DUT) parameters. In one embodiment, the closest point to the measured data is determined utilizing a successive approximation technique which includes estimating an initial point on a reciprocity manifold, approximating the manifold as a linear surface, and moving along the surface until the normal points directly at the measured data. The data is then projected onto the reciprocity manifold to produce the next iteration in the process.

The method of the invention supplements and extends a conventional two port calibration algorithm to properly compensate for the reciprocity constraint of passive networks such as cables and connecting hardware.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other advantages and features of the invention will become more apparent from the detailed description of the preferred embodiments of the invention given below with reference to the accompanying drawings in which:

FIG. 1 is an illustration of a conventional error model for network analyzer measurements;

FIG. 2 is a graphical illustration of a reciprocity manifold;

FIG. 3 is a flow chart of a method for correcting reciprocity error in two port network measurements; and

FIG. 4 is an illustration of a 12 term error model for two port measurements.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

In making a 2 port measurement a number of calibration parameters and 4 raw measurements are needed to completely characterize a DUT. The information needed may be described as a multidimensional complex vector {right arrow over (v)}, and the actual S-parameter matrix S_(A) (see FIG. 1) can be determined as $\begin{matrix} {S_{A} = {\begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix} = {f\left( \overset{\rightarrow}{v} \right)}}} & \left( {{Eq}.\quad 1} \right) \end{matrix}$

where s₁₁ is the input reflection parameter at port 1 of the network analyzer, s₁₂ is the reverse transmission parameter at port 2, s₂₁ is the forward transmission parameter at port 2 and s₂₂ is the output reflection parameter at port 2.

The function ƒ is defined by a method for a general intervening network, which is discussed in co-pending U.S. application Ser. No. 09/XXX,XXX, filed concurrently with this application (on XX, XX, 2000), and entitled “A Method for Calibrating Two Port High Frequency Measurements,” the entire contents of which is incorporated by reference herein. Briefly, the method for a general intervening network can be used to determine scattering parameters in the presence of an arbitrary intervening network in the forward and reverse directions. Equating s₂₁ and s₁₂ yields the scalar constraint which is used to obtain matrix symmetry

T({right arrow over (v)})=0  (Eq. 2)

where {right arrow over (v)} defines the vector which includes the measured data for the DUT as well as the calibration coefficients. At the moment that T({right arrow over (v)}) is equal to zero, the matrix of Eq. 1 will be symmetric.

The occurrence of matrix symmetry may be obtained from a geometric interpretation whereby the region where T({right arrow over (v)})=0 defines an n−1 dimensional complex surface in an n dimensional complex space. Within this constraint surface, defined herein as the reciprocity manifold, the closest point to the measured data vector defines the best symmetric matrix approximation. This point is located where the ‘normal’ to the manifold surface points directly at the measured data vector. Where {right arrow over (P)}₀ is the optimal point on the surface and {right arrow over (P)} is the measured data point, the optimal condition can be represented as:

{right arrow over (P)} ₀ −{right arrow over (P)}=μ∇T({right arrow over (P)} ₀)*  (Eq. 3)

where μ is a scalar constant.

For a 12 term error model (illustrated in the network of FIG. 4), there are 12 calibration parameters and 4 raw data measurements, indicating that the dimension of {right arrow over (v)} is 16. In this case,

T({right arrow over (v)})=v ₅ v ₁₀(v ₁₅ −v ₈)(v ₁₃ −v ₁)−v ₄ v ₁₁

(v ₁₆ −v ₇)(v ₁₄ −v ₂)+(v ₁₅ −v ₈)(v ₁ v ₁₂ +v ₃ v ₁₀ −v

12 v ₁₃)+(v ₁₄ −v ₂)(v ₆ v ₁₆ −v ₆ v ₇ −v ₄ v ₉).  (Eq. 4)

FIG. 2 is an illustration of a reciprocity manifold, where a manifold is a surface in a vector space. The reciprocity manifold is a surface where any point within the manifold possesses the imposed reciprocity constraints. As shown in FIG. 2, the measured data point {right arrow over (P)} will generally be on the surface defined by T({right arrow over (P)})=ε, where ε generally is small and represents the difference between the measured data point and the desired point on the reciprocity manifold due to the accuracy of the new “Algorithm for a General Intervening Network”

FIG. 3 is a flow chart of the new method for correcting reciprocity error in two port network measurements. First, via a software program residing on a PC, data point {right arrow over (P)} is determined by moving from the measured point in the direction of the normal to the surface T({right arrow over (v)})=ε until the surface T({right arrow over (v)})=0 is reached. (Step 1).

The point of intersection can be defined as:

T({right arrow over (P)}+λ∇T({right arrow over (P)})*)=0  (Eq. 5)

This expression can be evaluated via a Taylor expansion of T({right arrow over (v)}) derived from Eq. 5 which provides that

T({right arrow over (P)})+λ|∇T({right arrow over (P)})|²≈0  (Eq. 6)

where $\begin{matrix} {\lambda \approx {- \quad \frac{T\left( \overset{\rightarrow}{P} \right)}{{{\nabla{T\left( \overset{\rightarrow}{P} \right)}}}^{2}}}} & \left( {{Eq}.\quad 7} \right) \end{matrix}$

{right arrow over (P)}+λΔT({right arrow over (P)})* in Eq. 5 represents a straight line from the measured data point {right arrow over (P)} in the direction of the normal on the surface T({right arrow over (P)})=ε.

The starting point for the iteration is the projection of {right arrow over (P)}₁ onto the reciprocity manifold, where {right arrow over (P)}₁ is given by the relationship $\begin{matrix} {{\overset{\rightarrow}{P}}_{1} \equiv {\overset{\rightarrow}{P} - \quad {\frac{{T\left( \overset{\rightarrow}{P} \right)}^{\prime}}{{{\nabla{T\left( \overset{\rightarrow}{P} \right)}}}^{2}}{\nabla{T\left( \overset{\rightarrow}{P} \right)}}}}} & \left( {{Eq}.\quad 8} \right) \end{matrix}$

This equation can be obtained by substituting Eq. 6 for λ in Eq. 5. This projection is achieved by modifying one of the components of {right arrow over (P)}₁ to force T({right arrow over (P)}₁) to be identically zero.

FIG. 4 is an illustration of a 12 term error model for two port network measurements wherein an error term is associated with each connection path in the network. Application of the method for the general intervening network to the network shown in FIG. 4 yields 12 unknown quantities from the intervening network and 4 uncalibrated measurements of the DUT. These 16 quantities completely define all of the information needed to compute the actual S-parameters of the DUT, and are expressed in vector form as: $\begin{matrix} {v_{s} = {\left\lbrack \quad \begin{matrix} e_{00} & e_{30} & {e_{10}e_{01}} & \frac{e_{01}}{e_{32}} & e_{11} & \frac{e_{01}e_{22}}{e_{32}} & p_{33} & p_{03} & {p_{23}p_{32}} & \frac{p_{32}}{p_{01}} & p_{22} & \frac{p_{11}p_{32}}{p_{01}} & {sm}_{11} & {sm}_{21} & {sm}_{12} & {sm}_{22} \end{matrix} \right\rbrack.}} & \left( {{Eq}.\quad 9} \right) \end{matrix}$

where each e in Eq. 9 represents an appropriate component in a S-parameter characterization of the intervening network in the forward direction, each p represents the appropriate component in the S-parameter characterization of the intervening network in the reverse direction, and sm₁₁, sm₂₁, sm₁₂, and sm₂₂ are the measured input reflection at port 1 of the network analyzer, the measured forward transmission at port 2, the measured reverse transmission at port 2 and the measured output reflection at port 2, respectively.

For the 12 term error model, the projection is achieved by modifying the first component of {right arrow over (P)}₁ which is denoted as v₁, where $\begin{matrix} {v_{1} = {v_{13} + \frac{v_{3}v_{10}}{{v_{5}v_{10}} - v_{12}} + \frac{v_{4}{v_{9}\left( {v_{14} - v_{2}} \right)}}{\left( {v_{8} - v_{15}} \right)\left( {{v_{5}v_{10}} - v_{12}} \right)} + \frac{\left( {v_{16} - v_{7}} \right)\left( {v_{14} - v_{2}} \right)\left( {{v_{4}v_{11}} - v_{6}} \right)}{\left( {v_{8} - v_{15}} \right)\left( {{v_{5}v_{10}} - v_{12}} \right)}}} & \left( {{Eq}.\quad 10} \right) \end{matrix}$

and v₁ through v₁₂ represent the 12 calibration coefficients and v₁₃ through v₁₆ represent the four the raw data points sm₁₁, sm₁₂, sm₂₁, sm₂₂ of Eq. 9. This projection {right arrow over (Q)}₁ of {right arrow over (P)}₁ may be represented by the functional relationship {right arrow over (Q)}₁=proj({right arrow over (P)}₁).

Next, given the n^(th) iterant {right arrow over (Q)}_(n) (where {right arrow over (Q)}₁ is the starting point), the next iterant {right arrow over (Q)}_(n+1) is computed (step 2), according to the relationship

{right arrow over (P)} _(n+1) ={right arrow over (P)}+({right arrow over (Q)} _(n) −{right arrow over (P)})·{right arrow over (u)}({right arrow over (Q)} _(n)){right arrow over (u)}({right arrow over (Q)} _(n))  (Eq. 11)

where $\begin{matrix} {{\overset{\rightarrow}{u}\left( {\overset{\rightarrow}{Q}}_{n} \right)} \equiv {\frac{\nabla{T\left( {\overset{\rightarrow}{Q}}_{n} \right)}^{*}}{{{\nabla T}\left( {\overset{\rightarrow}{Q}}_{n} \right)}}.}} & \left( {{Eq}.\quad 12} \right) \end{matrix}$

These equations are derived by approximating T({right arrow over (v)}) as a linear surface which passes through {right arrow over (Q)}_(n). In Eq. 11, {right arrow over (P)}_(n+1) is the point on the linear surface having a normal which points directly to {right arrow over (P)}₁. {right arrow over (P)}_(n+1) is subsequently projected onto the reciprocity manifold. This is accomplished by modifying the first component of {right arrow over (P)}_(n+1) in accordance with Eq. 9. As a result of the modification, the projected point becomes equal to {right arrow over (Q)}_(n+1).

Subsequently, convergence is checked by examining the cosine of the angle between {right arrow over (Q)}_(n)−{right arrow over (P)} and ∇T({right arrow over (Q)}_(n))*. (Step 3) This is achieved by computing the inner product of $\begin{matrix} {\frac{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}{{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}} \cdot \frac{\nabla{T\left( {\overset{\rightarrow}{Q}}_{n} \right)}^{*}}{{{\nabla T}\left( {\overset{\rightarrow}{P}}_{n} \right)^{*}}}} & \left( {{Eq}.\quad 13} \right) \end{matrix}$

If this quantity is sufficiently close to 1, the process is terminated. Otherwise, a return to step 2 occurs and the process is repeated. A value of 0.9999999999, for example, has been achieved in less than five iterations and provides acceptable results. However, the required closeness to 1 depends on the desired level of accuracy which is dependent to some extent on the frequency being evaluated.

S-parameter measurements of reciprocal networks using a network analyzer result in symmetric matrices. Errors associated with the network analyzer measurements can result from either non-ideal conditions in the measurement equipment, resulting in a non-symmetrical matrix. Using the method according to the invention, a best symmetric approximation is achieved via processing on a PC.

Although the invention has been described and illustrated in detail, it is to be clearly understood that the same is by way of illustration and example, and is not to be taken by way of limitation. The spirit and scope of the present invention are to be limited only by the terms of the appended claims. 

What is claimed is:
 1. A method for correcting reciprocity error in two port network measurements, comprising the steps of: estimating an initial data point on a reciprocity manifold; performing an iteration to determine an optimal point on the manifold; checking for matrix symmetry by determining whether a normal to the reciprocity manifold points to a measured data point; and performing subsequent iterations until matrix symmetry is achieved within a predetermined tolerance to correct reciprocity error in the two port network measurements.
 2. The method of claim 1, wherein said performing step comprises: approximating the reciprocity manifold as a linear surface; determining a vector point within the linear surface having the normal which points to the measured data point; and projecting the initial data point onto the reciprocity manifold to compute a next iterant.
 3. The method of claim 2, wherein said projection step comprises: modifying a first component of the iterant until a modified vector of the iterant is on the reciprocity manifold.
 4. The method of claim 1, wherein said checking step comprises: measuring a cosine of an angle of a difference between an optimal point on a linear surface and the measured data point, and the normal to the reciprocity manifold at the optimal point.
 5. The method of claim 1, wherein said checking step comprises: evaluating an inner product of two vectors to determine whether the normal to the reciprocity manifold points to the measured data point; evaluating whether the inner product is substantially close to one; and wherein the predetermined tolerance is the inner product being substantially equal to one.
 6. The method of claim 1, wherein said estimating step comprises: utilizing a Taylor expansion to estimate an initial starting point on the reciprocity manifold.
 7. The method of claim 3, wherein said step of modifying is performed using the relationship ${v_{1} = {v_{13} + \frac{v_{3}v_{10}}{{v_{5}v_{10}} - v_{12}} + \frac{v_{4}{v_{9}\left( {v_{14} - v_{2}} \right)}}{\left( {v_{8} - v_{15}} \right)\left( {{v_{5}v_{10}} - v_{12}} \right)} + \frac{\left( {v_{16} - v_{7}} \right)\left( {v_{14} - v_{2}} \right)\left( {{v_{4}v_{11}} - v_{6}} \right)}{\left( {v_{8} - v_{15}} \right)\left( {{v_{5}v_{10}} - v_{12}} \right)}}},$

where v₁ through v₁₂ are calibration coefficients and v₁₃ through v₁₆ are raw data points.
 8. The method of claim 4, wherein said evaluating step includes the step of evaluating ${\frac{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}{{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}} \cdot \frac{\nabla{T\left( {\overset{\rightarrow}{Q}}_{n} \right)}^{*}}{{{\nabla T}\left( {\overset{\rightarrow}{P}}_{n} \right)^{*}}}},$

where {right arrow over (Q)}_(n) is an n^(th) iterant, {right arrow over (P)} is the measured data point, ∇T({right arrow over (Q)}_(n))* is a normal to a surface at {right arrow over (Q)}_(n) and ∇T({right arrow over (P)}_(n))* is the normal to the surface at {right arrow over (P)}_(n).
 9. The method of claim 5, wherein said two vectors comprises the relationship ${\frac{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}{{{\overset{\rightarrow}{Q}}_{n} - \overset{\rightarrow}{P}}} \cdot \frac{\nabla{T\left( {\overset{\rightarrow}{Q}}_{n} \right)}^{*}}{{{\nabla T}\left( {\overset{\rightarrow}{P}}_{n} \right)^{*}}}},$

where {right arrow over (Q)}_(n) is an n^(th) iterant, {right arrow over (P)} is the measured data point, ∇T({right arrow over (Q)}_(n))* is a normal to a surface at Q_(n) and ∇T({right arrow over (P)}_(n))* is the normal to the surface at {right arrow over (P)}_(n).
 10. A method for correcting reciprocity error in two port network analyzer measurements, comprising the steps of: measuring an initial data point using the analyzer; estimating a position of the data point on a reciprocity manifold; performing an iteration to determine an optimal point on the manifold; checking for matrix symmetry by determining whether a normal to the reciprocity manifold points to a measured data point; correcting reciprocity error within a matrix by performing subsequent iterations until matrix symmetry is achieved within a predetermined tolerance. 